#include "pch.h"
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
class Solution {
public:
	int minCostClimbingStairs(vector<int>& cost) {
		int n = cost.size();
		vector<int> dp(n + 1);
		dp[0] = dp[1] = 0;
		for (int i = 2; i <= n; i++) {
			dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
		}
		return dp[n];
	}
};

int main()
{
	Solution s;
	int num = 44;
	vector<int> v{ 1, 100, 1, 1, 1, 100, 1, 1, 100,1 };
	int res = s.minCostClimbingStairs(v);
	cout << res << endl;

	return 0;
}